#include <iostream>
using namespace std;

/*排序,插入排序*/

void InsertionSort(int *arr, int size)
{

    int min = arr[0];
    for (int i = 1; i < m; i++)
    {
        if (arr[i] < min)
        {
            min = arr[i];
        }
    }






    for (int i = 1; i < size; i++)
    {
        int key = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > key)
        {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}

int main()
{
    int a[] = {32, 44, 29, 31, 49, 13, 4};
    InsertionSort(a, sizeof(a) / sizeof(a[0]));
    for (int i = 0; i < 5; i++)
    {
        cout << a[i] << " ";
    }
    return 0;
}